Bsp Programming 1. the Bsp Model
نویسنده
چکیده
The Bulk Synchronous Parallel (BSP) model provides a uni-ed framework for the design and programming of general purpose parallel computing systems. In this paper we describe some programming language developments which are currently being pursued as part of this new, uniied approach to scalable parallel computing. A parallel random access machine (PRAM) 4] consists of a collection of processors which compute synchronously in parallel and which communicate with a common global random access memory. A major issue in theoretical computer science since the late 1970s has been to determine the extent to which the idealised PRAM model can be eeciently implemented on physically realistic distributed memory architectures. A number of new routing and memory management techniques have been developed which show that eecient implementation is indeed possible in many cases 5, 10, 11]. The eecient implementation of a single address space on a distributed memory architecture requires an eecient method for the distributed routing of read and write requests, and of the replies to read requests, through the network of processors. Consider the problem of packet routing on a p-processor network. Let an h-relation denote a routing problem where each processor has at most h packets to send to various processors in the network, and where each processor is also due to receive at most h packets from other processors. Here, a packet is one word of information, such as e.g. a real number or an integer. Using two-phase randomised routing one can, for example, show that every (log p)-relation can be realised on a p processor hypercube in O(log p) steps. To deal with the problem of \hot spots",
منابع مشابه
Programming Research Group NETWORK PERFORMANCE ASSESSMENT UNDER THE BSP MODEL
The BSP model by L.G. Valiant has been proposed as a unifying and bridging model for the design, analysis and programming of general purpose parallel computing systems. A number of libraries have been implemented that allow programming following the BSP paradigm with one of them being the Oxford BSP Toolset. Algorithm designers and software engineers are able to study the performance of their i...
متن کاملتاثیر داروی زولدرونیک اسید در بیان و متیلاسیون ژن BSP در طول تمایز استئوبلاستیک سلولهای بنیادی مزانشیمی
Background and Aim: Bone sialoprotein (BSP) is a specific marker of osteoblastic differentiation. In this research, the effect of Zoledronic Acid on BSP expression and methylation status during osteoblastic differentiation of mesenchymal stem cells (MSCs) was evaluated. Materials and Methods: In this experimental study, MSCs were isolated from human bone marrow. For osteogenic differentiation,...
متن کاملDesign of Departmental Metacomputing ML
Bulk Synchronous Parallel ML or BSML is a functional dataparallel language for programming bulk synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and indeterminism are avoided. For large scale applications, more than one parallel machine is needed. We consider here the design and cost-model of a BSML-like language devoted to the programming of such applic...
متن کاملProgramming Research Group TRANSGRESSING THE BOUNDARIES: UNIFIED SCALABLE PARALLEL PROGRAMMING
The diverse architectural features of parallel computers, and the lack of commonly accepted parallel-programming environments, meant that software development for these systems has been signi cantly more di cult than the sequential case. Until better approaches are developed, the programming environment will remain a serious obstacle to mainstream scalable parallel computing. The work reported ...
متن کاملProgramming Research Group ALGORITHMIC AND PRACTICAL CONSIDERATIONS FOR DENSE MATRIX COMPUTATIONS ON THE BSP MODEL
The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable, among diverse parallel machines. In this work we present direct BSP algorithms for dense matrix computations such as matrix multiplication, LU decomposition, determinant...
متن کاملThe design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994